Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Optimal Discrete Structures and Algorithms ODSA 2006")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 23 of 23

  • Page / 1
Export

Selection :

  • and

Optimal Discrete Structures and Algorithms ODSA 2006BRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 2009, Vol 157, Num 9, issn 0166-218X, 241 p.Conference Proceedings

Optimal matrix-segmentation by rectanglesENGEL, Konrad.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2015-2030, issn 0166-218X, 16 p.Conference Paper

Dynamically maintaining split graphsHEGGERNES, Pinar; MANCINI, Federico.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2057-2069, issn 0166-218X, 13 p.Conference Paper

Relaxation procedures on graphsWEGERT, Elias; REIHER, Christian.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2207-2216, issn 0166-218X, 10 p.Conference Paper

t-wise balanced designsLAUE, Reinhard.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2136-2142, issn 0166-218X, 7 p.Conference Paper

Orthogonal covers by multiplication graphsGRONAU, Hans-Dietrich O. F; SCHMIDMEIER, Markus.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2048-2056, issn 0166-218X, 9 p.Conference Paper

The incidence game chromatic numberANDRES, Stephan Dominique.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 1980-1987, issn 0166-218X, 8 p.Conference Paper

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2BABURIN, A. E; CROCE, F. Della; GIMADI, E. K et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 1988-1992, issn 0166-218X, 5 p.Conference Paper

Intersection models of weakly chordal graphsGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2031-2047, issn 0166-218X, 17 p.Conference Paper

A generalization of Sperner's theorem and an application to graph orientationsJIANGUO QIAN; ENGEL, Konrad; WEI XU et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2170-2176, issn 0166-218X, 7 p.Conference Paper

An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errorsKUROKI, Yusuke; MATSUI, Tomomi.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2124-2135, issn 0166-218X, 12 p.Conference Paper

On some algorithmic problems regarding the hairpin completionMANEA, Florin; MARTIN-VIDE, Carlos; MITRANA, Victor et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2143-2152, issn 0166-218X, 10 p.Conference Paper

Merging covering arrays and compressing multiple sequence alignmentsRONNESETH, Andreas H; COLBOURN, Charles J.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2177-2190, issn 0166-218X, 14 p.Conference Paper

Online scheduling with general machine cost functionsIMREH, Cs.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2070-2077, issn 0166-218X, 8 p.Conference Paper

Integral point sets over ℤmnKOHNERT, Axel; KURZ, Sascha.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2105-2117, issn 0166-218X, 13 p.Conference Paper

Algorithmic aspects of a general modular decomposition theoryBUI-XUAN, B.-M; HABIB, M; LIMOUZY, V et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 1993-2009, issn 0166-218X, 17 p.Conference Paper

Numerical characterization of n-cube subset partitioningSAHAKYAN, H.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2191-2197, issn 0166-218X, 7 p.Conference Paper

Calculating the extremal number ex(v; {C3, C4, ... , Cn})JIANMIN TANG; YUQING LIN; BALBUENA, Camino et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2198-2206, issn 0166-218X, 9 p.Conference Paper

Construction of binary and ternary self-orthogonal linear codesKOHNERT, Axel; WASSERMANN, Alfred.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2118-2123, issn 0166-218X, 6 p.Conference Paper

Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problemsIWASA, Masaru; SAITO, Hiroo; MATSUI, Tomomi et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2078-2088, issn 0166-218X, 11 p.Conference Paper

An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne―Goodman―Hedetniemi algorithmCOOPER, Colin; ZITO, Michele.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2010-2014, issn 0166-218X, 5 p.Conference Paper

Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and constructionPANDA, B. S; DAS, Anita.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2153-2169, issn 0166-218X, 17 p.Conference Paper

The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluenceKALINOWSKI, Thomas.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2089-2104, issn 0166-218X, 16 p.Conference Paper

  • Page / 1